Decision versions of optimization problems: cardinality constraint (lower bound) as a CNF Horn formula for Maximum Matching
نویسنده
چکیده
We provide a formula for the cardinality constraint, a lower bound in the form of |F | ≥ K, in such a way that the conjunction of the BFC and the OFC (explained below) can be solved simultaneously. The parameter K can vary from instance to instance. We assume the availability of a successor predicate, and that the domain is ordered. To our knowledge, no polynomially solvable expression has been developed so far, even for a simple problem such as Matching. However, once such a formula is developed for Matching, it can also be applied to harder problems such as Clique.
منابع مشابه
A Pigeon-Hole Based Encoding of Cardinality Constraints
In this paper, we propose a new encoding of the cardinality constraint ∑i=1 xi > b. It makes an original use of the general formulation of the Pigeon-Hole principle to derive a formula in conjunctive normal form (CNF). Our Pigeon-Hole based CNF encoding can be seen as a nice and simple way to express the semantic of the cardinality constraint, that can be defined as how to put b pigeons into n ...
متن کاملInfluence of CNF Encodings of AtMost-1 Constraints on UNSAT-based PMSAT Solvers
Partial maximum Boolean satisfiability (Partial MaxSAT or PMSAT) is an optimization variant of Boolean Satisability (SAT). It asks to find a variable assignment that satisfies all hard clauses and the maximum number of soft clauses in a Boolean formula. Several exact PMSAT solvers have been developed since the introduction of the MaxSAT evaluations in 2006, based mainly on the DavisPutnam-Logem...
متن کاملOn the Approximability of Splitting-SAT in 2-CNF Horn Formulas
Splitting a variable in a Boolean formula means to replace an arbitrary set of its occurrences by a new variable. In the minimum splitting SAT problem, we ask for a minimum-size set of variables to be split in order to make the formula satisfiable. This problem is known to be APX-hard, even for 2-CNF formulas. We consider the case of 2CNF Horn formulas, i. e., 2-CNF formulas without positive 2-...
متن کاملA Lower Bound on CNF Encodings of the At-Most-One Constraint
Constraint “at most one” is a basic cardinality constraint which requires that at most one of its n boolean inputs is set to 1. This constraint is widely used when translating a problem into a conjunctive normal form (CNF) and we investigate its CNF encodings suitable for this purpose. An encoding differs from a CNF representation of a function in that it can use auxiliary variables. We are esp...
متن کاملTwo-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints. Firstly, we consider some lower level constraint qualifications (CQs) for this problem. Then, under these CQs, we derive formula for estimating the subdifferential of its valued function. Finally, we present some necessary optimality condit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014